Various exact analytical solutions of a variable-coefficient Kadomtsev–Petviashvili equation

Nonlinear Dynamics - Under investigation is a generalized (3 + 1)-dimensional variable- coefficient Kadomtsev– Petviashvili equation in fluid mechanics. Various exact analytical solutions are...     

Skyrmion transport driven by pure voltage generated strain gradient

The magnetic skyrmion transport driven by pure voltage-induced strain gradient is proposed and studied via micromagnetic simulation. Through combining the skyrmion with multiferroic heterojunction, a voltage-induced uniaxial strain gradient is adjusted to move skyrmions. In the system, a pair of short-circuited trapezoidal top electrodes can generate the symmetric strain. Due to the symmetry of strain, the magnetic skyrmion can be driven with a linear motion in the middle of the nanostrip without deviation. We calculate the strain distribution generated by the trapezoidal top electrodes pair, and further investigate the influence of the strain intensity as well as the strain gradient on the skyrmion velocity. Our findings provide a stable and low-energy regulation method for skyrmion transport.     

GLOBAL WELL-POSEDNESS FOR FRACTIONAL NAVIER-STOKES EQUATIONS IN VARIABLE EXPONENT FOURIER-BESOV-MORREY SPACES

In this paper we study the Cauchy problem of the incompressible fractional Navier-Stokes equations in critical variable exponent Fourier-Besov-Morrey space F N^s(·)p(·),h(·),q(R³)with s(·)=4-2α-3/p(·).We prove global well-posedness result with small initial data belonging to FN^4-2α-3/p(·)p(·),h(·)q(R³).The result of this paper extends some recent work.     

A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form

The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.